Computing the zeros of periodic descriptor systems
نویسندگان
چکیده
منابع مشابه
Computing the zeros of periodic descriptor systems
In this paper, we give a numerically reliable algorithm to compute the zeros of a periodic descriptor system. The algorithm is a variant of the staircase algorithm applied to the system pencil of an equivalent lifted time-invariant state-space system and extracts a low-order pencil which contains the zeros (both 6nite and in6nite) as well as the Kronecker structure of the periodic descriptor sy...
متن کاملOn computing the zeros of periodic systems
We present an efficient and numerically reliable approach to compute the zeros of a periodic system. The zeros are defined in terms of the transfer-function matrix corresponding to an equivalent lifted statespace representation as constant system. The proposed method performs locally row compressions of the associated system pencil to extract a low order pencil which contains the zeros (both fi...
متن کاملOn computing minimal realizations of periodic descriptor systems
We propose computationally efficient and numerically reliable algorithms to compute minimal realizations of periodic descriptor systems. The main computational tool employed for the structural analysis of periodic descriptor systems (i.e., reachability and observability) is the orthogonal reduction of periodic matrix pairs to Kronecker-like forms. Specializations of a general reduction algorith...
متن کاملReachability and Observability of Periodic Descriptor Systems
In the second-half of the last century, the development of systems and control theory, together with the achievements of digital control and signal processing, has set the stage for renewed interest in the study of periodic systems, both in continuous and discrete time; see, e.g., [24, 45, 36, 10, 43, 12] and the survey papers [3, 4]. This has been amplified by specific application demands in t...
متن کاملPeriodic descriptor systems: solvability and conditionability
We consider discrete-time linear periodic descriptor systems and study the concepts of solvability and conditionability introduced by D. Luenberger. We prove that solvability is equivalent to conditionability, just as in the time-invariant case. We give a characterization of solvability/conditionability in terms of a cyclic matrix pencil and, furthermore, propose a simple test via the periodic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2003
ISSN: 0167-6911
DOI: 10.1016/s0167-6911(03)00194-4